On reachability equivalence for BPP-nets
نویسندگان
چکیده
منابع مشابه
On Reachability Equivalence for BPP-Nets
21 Now we show the size of the semilinear set representation as well as the time required for generating such a representation. From Condition 1, each component of is bounded by 2 d 1 s 2 ; hence jBj (i.e., the number of distinct bases of the semilinear set) is bounded by (2 d 1 s 2) k 2 d 1 s 3 (k(s) is the dimension of). As a result, the size of B is bounded by k 3 (log 2 (2 d 1 s 2)) 3 (2 d ...
متن کاملOn Sampling Continuous Timed Petri Nets: Reachability ”equivalence” under Infinite Servers Semantics
This paper addresses a sampling problem for timed continuous Petri nets under infinite servers semantics. Different representations of the continuous Petri net system are given, the first two in terms of piecewise linear system and the third one, for the controlled continuous Petri nets systems, in terms of a particular linear constrained system with null dynamic matrix. The last one is used to...
متن کاملCovering Problems of BPP-Petri Nets
Yen proposed a construction for a semilinear representation of the reachability set of BPP-Petri nets which can be used to decide the equivalence problem of two BPP-PNs in doubly exponential time. We rst address a gap in this construction which therefore does not always represent the reachability set. We propose a solution which is formulated in such a way that a large portion of Yen's construc...
متن کاملReachability in Contextual Nets
Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of reachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix ...
متن کاملCanonical Equivalence Relations on Nets
We give a list of canonical equivalence relations on discrete nets of the positive unit sphere of c0. This generalizes results of W. T. Gowers [1] and A. D. Taylor [5].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00147-8